Evacuation of labelled graphs
نویسندگان
چکیده
منابع مشابه
Evacuation of labelled graphs
In this note, we extend Schiitzenberger’s evacuation of Young tableaux (Schtitzenberger, 1963), and naturally labelled posets (Schltzenberger, 1972), to labelled graphs. It is shown that evacuation is an involution, and that in that in the dual evacuation, tracks and trajectories are interchanged. Let G = ( V, E) be a simple undirected graph without loops; V is its set of vertices, and E its se...
متن کامل- Algebras of Labelled Graphs
We describe a class of C *-algebras which simultaneously generalise the ul-tragraph algebras of Tomforde and the shift space C *-algebras of Matsumoto. In doing so we shed some new light on the different C *-algebras that may be associated to a shift space. Finally, we show how to associate a simple C *-algebra to an irreducible sofic shift.
متن کاملC∗-algebras of Labelled Graphs
We describe a class of C∗-algebras which simultaneously generalise the ultragraph algebras of Tomforde and the shift space C∗-algebras of Matsumoto. In doing so we shed some new light on the different C∗-algebras that may be associated to a shift space. Finally, we show how to associate a simple C∗-algebra to an irreducible sofic shift. keywords: C∗-algebras, labelled graph, ultragraph, Matsumo...
متن کاملThe Number of Labelled k-Arch Graphs
In this note, we deal with k-arch graphs, a generalization of trees, which contain k-trees as a subclass. We show that the number of vertex-labelled k-arch graphs with n vertices, for a fixed integer k ≥ 1, is (nk)n−k−1. As far as we know, this is a new integer sequence. We establish this result with a one-to-one correspondence relating k-arch graphs and words whose letters are k-subsets of the...
متن کاملAsymptotic Enumeration of Labelled Graphs by Genus
We obtain asymptotic formulas for the number of rooted 2-connected and 3connected surface maps on an orientable surface of genus g with respect to vertices and edges simultaneously. We also derive the bivariate version of the large facewidth result for random 3-connected maps. These results are then used to derive asymptotic formulas for the number of labelled k-connected graphs of orientable g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1994
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)00569-d